lnteger Dilation and Contraction for Quadtrees and Octrees

نویسندگان

  • Leo Stocco
  • Gunther Schrack
چکیده

~ Integer dilation and contraction are functions used in conjunction with quadtree and octree mapping systems. Dilation is the process of inserting a number of zeros before each bit in a word and contraction is the process of removing those zeros. Present methods of dilation and contraction involve lookup tables which consume considerable amounts of memory for mappings of large or high resolution display devices but are very fast under practical limits. A method is proposed which rivals the speed of the tabular methods but eliminates the tables, thereby eliminating the associated memory consumption. The proposed method is applicable to both dilation and contraction for both quadtrees and octrees.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simple and Efficient Traversal Methods for Quadtrees and Octrees

Quadtrees and octrees are used extensively throughout computer graphics and in many other diverse fields such as computer vision, robotics, and pattern recognition. Managing information stored in quadtrees and octrees requires basic tree traversal operations such as point location, region location, and neighbor searches. This paper presents simple and efficient methods for performing these oper...

متن کامل

Neighbor finding in images represented by octrees

Algorithms are presented for moving between adjacent blocks in an octree representation of an image. Motion is possible in the direction of a face, edge, and a vertex, and between blocks of arbitrary size. The algorithms are based on a generalization and simplification of techniques developed earlier for two dimensions (i.e., in quadtrees). They are also applicable to quadtrees. The difference ...

متن کامل

Image Representation Using Finite State Automata

Image representation using quadtrees is useful in many applications and is well known in computer graphics. It has been shown that we can represent quadtrees asrationallanguages that are recognizable by finite state automata (FSA) [1]. These FSA can use less memory and are more flexible than their corresponding quadtrees. Binary image representation using FSA follows these two main steps: (1) F...

متن کامل

Parallel Manipulations of Octrees and Quadtrees

Octrees o er a powerful means for representing and manip ulating D objects This paper presents an implementation of octree manipulations using a new approach on a shared memory architecture Octrees are hierarchical data structures used to model D objects The manipulation of these data structures involves performing independent computations on each node of the octree Octrees are much easier to d...

متن کامل

A Practical Algorithm for Computing Neighbors in Quadtrees, Octrees, and Hyperoctrees

A simple and general method for computing location codes of same-size neighboring nodes for any direction within quadtrees is developed and then extended for octrees and 4-D hyperoctrees. The effect of our algorithm is to ascend the tree, guided by navigational cues, until the nearest common ancestor of the target node and the computed neighbor node is reached. An advantage of our algorithm is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004